Lower bounds of length of longest cycles in graphs involving neighborhood unions
نویسندگان
چکیده
منابع مشابه
Relative Length of Longest Paths and Cycles in Graphs
For a graphG, let diff(G) = p(G)− c(G), where p(G) and c(G) denote the orders of a longest path and a longest cycle inG, respectively. LetG be a 3-connected graph of order n. In the paper, we give a best-possible lower bound to σ4(G) to assure diff(G) ≤ 1. The result settles a conjecture in J. Graph Theory 37 (2001), 137–156.
متن کاملNeighborhood Unions and Independent Cycles
We prove that if G is a simple graph of order n ≥ 3k such that |N(x) ∪ N(y)| ≥ 3k for all nonadjacent pairs of vertices x and y, then G contains k vertex independent cycles.
متن کاملRelative length of longest paths and longest cycles in triangle-free graphs
In this paper, we study triangle-free graphs. Let G = (VG, EG) be an arbitrary triangle-free graph with minimum degree at least two and σ4(G) ≥ |VG|+2. We first show that either for any path P in G there exists a cycle C such that |VP \ VC | ≤ 1, or G is isomorphic to exactly one exception. Using this result, we show that for any set S of at most δ vertices in G there exists a cycle C such that...
متن کاملSome lower bounds for the $L$-intersection number of graphs
For a set of non-negative integers~$L$, the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$. The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کاملChords of Longest Cycles in Cubic Graphs
We describe a general sufficient condition for a Hamiltonian graph to contain another Hamiltonian cycle. We apply it to prove that every longest cycle in a 3-connected cubic graph has a chord. We also verify special cases of an old conjecture of Sheehan on Hamiltonian cycles in 4-regular graphs and a recent conjecture on a second Hamiltonian cycle by Triesch, Nolles, and Vygen. 1997 Academic Press
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1997
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00226-m